Open Problems from CCCG 2006
نویسندگان
چکیده
An edge reconnection is an operation on a path of three consecutive vertices (a, b, c) of a chain or tree linkage; refer to Figure 1. If it is possible to fold the linkage, preserving edge lengths and avoiding self-intersection, to bring the two incident edges ab and bc into coincidence, then the edge reconnection breaks the connection between the edges at b, splits b into two vertices b1 and b2, and fuses a=c together. This operation changes a chain into a tree. If we apply this operation to a tree, there will generally be attachments at b; allow them to attach to either b1 or b2. Is it possible to reconfigure
منابع مشابه
Open Problems: Open Problems from CCCG 2005
Consider the following special case of planar point location: preprocess k sets of lines, where each set consists of parallel lines, to support queries of the form “given a point p, what is the line immediately above or below p?” What is the fastest possible query time as a function of k and the total number n of lines? In other words, the n given lines have k distinct orientations. See Figure ...
متن کاملPolygons Flip Finitely: Flaws and a Fix
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdős posed this as an open problem in 1935, several independent purported proofs have been published. However, we uncover a plethora of errors and gaps in these arguments, and remedy these problems with a new (correct) proof.
متن کاملOpen problems from cccg 2001
Refer to Figure 1. A monotone matching is a set of n segments, each the portion of a unique pseudoline, and each spanning a unique slab, such that the left endpoint of each segment is above the right endpoint of the segment in the previous slab. In addition, the point on the first vertical line is below the left endpoint of the first segment, and the point on the last vertical line is above the...
متن کاملOpen Problems from CCCG 2008
A swimmer falls overboard in an equilateral triangle lake in a fog. If the edge length of the triangle is 1, what is the shortest length swimming path that ensures the swimmer will reach the shore? Swimming one unit straight in any direction certainly reaches the shore. The problem was originally posed in 1963. Besicovitch showed shortly afterward that a 3-link chain of length 3 √ 21/14 = 0.981...
متن کامل